An Introduction to Congregating in Multiagent Systems

نویسندگان

  • Christopher H. Brooks
  • Edmund H. Durfee
  • Aaron A. Armstrong
چکیده

We present congregating both as a metaphor for describing and modeling multiagent systems (MAS) and as a means for reducing coordination costs. We show how congregations can be used to explain and predict the behavior of self-interested agents that are searching for other agents to interact with. This framework is integrated with Vidal and Durfee’s CLRI framework [11] for evaluating learning within MAS. We provide experimental and analytical results which describe how the difficulty of the congregating problem increases exponentially with the number of agents, and present a solution to this in the form of labelers, which are agents that assign a description to a congregation, thereby reducing agents’ search problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem

Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...

متن کامل

A Concise Introduction to Multiagent Systems and Distributed Artificial Intelligence

Multiagent systems is an expanding field that blends classical fields like game theory and decentralized control with modern fields like computer science and machine learning. This monograph provides a concise introduction to the subject, covering the theoretical foundations as well as more recent developments in a coherent and readable manner. The text is centered on the concept of an agent as...

متن کامل

Learning in Multiagent Systems: An Introduction from a Game-Theoretic Perspective

We introduce the topic of learning in multiagent systems. We first provide a quick introduction to the field of game theory, focusing on the equilibrium concepts of iterated dominance, and Nash equilibrium. We show some of the most relevant findings in the theory of learning in games, including theorems on fictitious play, replicator dynamics, and evolutionary stable strategies. The CLRI theory...

متن کامل

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

متن کامل

Introduction to planning in multiagent systems

In most multiagent systems planning on forehand can help to seriously improve the efficiency of executing actions. The main difference between centrally creating a plan and constructing a plan for a system of agents lies in the fact that in the latter coordination plays the main part. This introduces a number of additional difficulties. This special issue discusses some of these difficulties in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000